Graph Notation for Concurrent Combinators
نویسنده
چکیده
We introduce graph notation for concurrent processes which does not use the notion of port names for its formulation. The operators in the algebra of graphs proposed in this paper are quite di erent from those in the original term representation, making such notions as connection and correspondence of communication ports explicit. We show how basic elements of process calculi such as agents, reduction, and behavioural equivalences are soundly formulated in the new setting. The work is based on the authors' study on concurrent combinators [9, 10], and can be considered as o ering another mathematical representation of the formal notion studied therein.w
منابع مشابه
Constructing a Bidirectional Transformation between BPMN and BPEL with Functional-logic Graph Parser Combinators
The abstract syntax of structured Business Process Models (BPMs) can be described by a context-free hypergraph grammar in a straightforward way. Functional-logic graph parser combinators can be used to construct powerful parsers for such context-free hypergraph grammars. These parsers can be enriched with semantic computations, e.g. to synthesize BPEL from BPMN. Moreover, they are bidirectional...
متن کاملReplication in Concurrent Combinators
We establish the behavioural representability of input preex and replication, which are two basic operators of the asynchronous-calculus 5, 6] (cf. 2]), an oospring of-calculus 14, 11], in a system of concurrent combinators which is an extension of cc 7]. Systems of concurrent combinators are simple formal systems based on a nite number of atoms with xed interaction rules and two connectives fo...
متن کاملProgramming Deep Concurrent Constraint Combinators
Constraint combination methods are essential for a flexible constraint programming system. This paper presents deep concurrent constraint combinators based on computation spaces as combination mechanism. It introduces primitives and techniques needed to program constraint combinators from computation spaces. The paper applies computation spaces to a broad range of combinators: negation, general...
متن کاملMinimality and Separation Results on Asynchronous Mobile Processes: Representability Theorems by Concurrent Combinators (Extended Abstract)
In 22, 23], we presented a theory of concurrent combinators for the asynchronous monadic-calculus without match or summation operator 7, 19]. The system of concurrent combinators is based on a nite number of atoms and xed interaction rules, but is as expressive as the original calculus, so that it can represent diverse interaction structures, including polyadic synchronous name passing 32] and ...
متن کاملParser Combinators in Scala
Parser combinators are well-known in functional programming languages such as Haskell. In this paper, we describe how they are implemented as a library in Scala, a functional object-oriented language. Thanks to Scala’s flexible syntax, we are able to closely approximate the EBNF notation supported by dedicated parser generators. For the uninitiated, we first explain the concept of parser combin...
متن کامل